Search results for "discrete [space-time]"
showing 10 items of 2035 documents
A remark on extrapolation of rearrangement operators on dyadic Hs, 0< s ≤1
2005
Links modulo knots and the isotopic realization problem
2001
Fixed Point Theorems with Applications to the Solvability of Operator Equations and Inclusions on Function Spaces
2015
1Department of Mathematics, King Abdulaziz University, P.O. Box 80203, Jeddah 21589, Saudi Arabia 2Department of Mathematical Analysis, University of Valencia, Spain 3Centre Universitaire Polydisciplinaire, Kelaa des Sraghna, Morocco 4Universite Cadi Ayyad, Laboratoire de Mathematiques et de Dynamique de Populations, Marrakech, Morocco 5Department of Mathematics and Computer Science, University of Palermo, Via Archirafi 34, 90123 Palermo, Italy
On the Existence of 1-Bounded Bi-ideals with the WELLDOC Property
2015
A combinatorial condition called well distributedoccurrences, or WELLDOC for short, has been introducedrecently. The proofs that WELLDOC property holds for thefamily of Sturmian words, and more generally, for Arnoux-Rauzy words are given in two papers by Balkova et al. The WELLDOC property for bounded bi-ideals is analysed inthis paper. The existence of a 1-bounded bi-ideal over thefinite alphabet that satisfies the WELLDOC property has beenproved by the authors.
Selmer's Multiplicative Algorithm
2011
Abstract.The behavior of the multiplicative acceleration of Selmer's algorithm is widely unknown and no general result on convergence has been detected yet. Solely for its 2-dimensional, periodic expansions, there exist some results on convergence and approximation due to Fritz Schweiger. In this paper we show that periodic expansions of any dimension do in fact converge and that the coordinates of the limit points are rational functions of the largest eigenvalue of the periodicity matrix.
Basic Sequences in the Dual of a Fréchet Space
2001
New lower bounds for the minimum distance of generalized algebraic geometry codes
2013
Abstract In this paper, we give a new lower bound for generalized algebraic geometry codes with which we are able to construct some new linear codes having better parameters compared with the ones known in the literature. Moreover, we give a relationship between a family of generalized algebraic geometry codes and algebraic geometry codes. Finally, we propose a decoding algorithm for such a family.
On the classification of algebraic function fields of class number three
2012
AbstractLet F be an algebraic function field of one variable having a finite field Fq with q>2 elements as its field of constants. We determine all such fields for which the class number is three. More precisely, we show that, up to Fq-isomorphism, there are only 8 of such function fields. For q=2 the problem has been solved under the additional hypothesis that the function field is quadratic.
Regularly Algebraizable Logics
2001
A sentential logic (S, C) is regularly algebraizable (alias 1-algebraizable) if it possesses a non-empty system E(p, q) of equivalence sentences such that E(p, q) ⊆ C(p, q).
A smallest irregular oriented graph containing a given diregular one
2004
AbstractA digraph is called irregular if its vertices have mutually distinct ordered pairs of semi-degrees. Let D be any diregular oriented graph (without loops or 2-dicycles). A smallest irregular oriented graph F, F=F(D), is constructed such that F includes D as an induced subdigraph, the smallest digraph being one with smallest possible order and with smallest possible size. If the digraph D is arcless then V(D) is an independent set of F(D) comprising almost all vertices of F(D) as |V(D)|→∞. The number of irregular oriented graphs is proved to be superexponential in their order. We could not show that almost all oriented graphs are/are not irregular.